Enumeration of Varlet and Comer Hypergroups
نویسندگان
چکیده
منابع مشابه
Enumeration of Varlet and Comer Hypergroups
In this paper, we study hypergroups determined by lattices introduced by Varlet and Comer, especially we enumerate Varlet and Comer hypergroups of orders less than 50 and 13, respectively. 1 Basic definitions and results An algebraic hyperstructure is a natural generalization of a classical algebraic structure. More precisely, an algebraic hyperstructure is a non-empty set H endowed with one or...
متن کاملEnumeration of Rosenberg hypergroups
The aimof this paper is to introduce the notion of generalmutually associative hypergroups and to give some properties of the hypergroups associated with binary relations related to these notions. A program written in C# computes the number of Rosenberg hypergroups that satisfies the property of (general) mutual associativity. © 2010 Elsevier Ltd. All rights reserved.
متن کاملon semihypergroups and hypergroups
in this thesis, first the notion of weak mutual associativity (w.m.a.) and the necessary and sufficient condition for a $(l,gamma)$-associated hypersemigroup $(h, ast)$ derived from some family of $lesssim$-preordered semigroups to be a hypergroup, are given. second, by proving the fact that the concrete categories, semihypergroups and hypergroups have not free objects we will introduce t...
15 صفحه اولActions of Finite Hypergroups
This paper is concerned with actions of finite hypergroups on sets. After introducing the definitions in the first section, we use the notion of ‘maximal actions’ to characterise those hypergroups which arise from association schemes, introduce the natural sub-class of *-actions of a hypergroup and introduce a geometric condition for the existence of *-actions of a Hermitian hypergroup. Followi...
متن کاملHYPERGROUPS AND GENERAL FUZZY AUTOMATA
In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/618